Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
نویسندگان
چکیده
منابع مشابه
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
Using computer databases of scientific papers in physics, biomedical research, and computer science, we have constructed networks of collaboration between scientists in each of these disciplines. In these networks two scientists are considered connected if they have coauthored one or more papers together. Here we study a variety of nonlocal statistics for these networks, such as typical distanc...
متن کاملNode centrality in weighted networks: Generalizing degree and shortest paths
Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been operationalized as weights. A few network measures have been proposed for weighted networks, including three common measures of node centrality: degree, closeness, and betweenness. However, these generalizations have solely focused on tie weights, and not on the number of tie...
متن کاملShortest Weighted Paths II
Lemma 1.1. Consider a (directed) weighted graph G = (V, E), w : E → R+ ∪ {0} with no negative edge weights, a source vertex s and an arbitrary distance value d ∈ R+ ∪ {0}. Let X = X ′ ∪ X ′′ , where X ′ = {v ∈ V : δ(s, v)< d} be the set of vertices that are less than d from s, X ′′ ⊆ {v ∈ V : δ(s, v) = d} be the set of vertices that are exactly d from s. Also, let d ′ = min{δ(s, u) : u ∈ V \ X ...
متن کاملEvolving Model of Weighted Networks Inspired by Scientific Collaboration Networks
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weightdriven models are considered. Compared with the BA model and other evolving models with preferential attachment, there are two significant generalizations. First, besides the new vertex added in ...
متن کاملShortest Paths in Networks
Finding the shortest path between two points in a network is a fundamental problem in computer science with many applications. By exploiting properties of the underlying networks we improve and extend one of the state-of-the-art algorithms for finding shortest paths in road networks, TRANSIT. We develop a new algorithm for finding shortest paths in public multi-modal transport networks, where w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2001
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.64.016132